منابع مشابه
On directed homotopy equivalences and a notion of directed topological complexity
This short note introduces a notion of directed homotopy equivalence (or dihomotopy equivalent) and of “directed” topological complexity (which elaborates on the notion that can be found in e.g. [9]) which have a number of desirable joint properties. In particular, being dihomotopically equivalent implies having bisimilar natural homologies (defined in [5]). Also, under mild conditions, directe...
متن کاملTopological Decomposition of Directed Graphs
The analysis of directed graphs is important in application areas like software engineering, bioinformatics, or project management. Distinguishing between topological structures such as cyclic and hierarchical subgraphs provides the analyst with important information. However, until now, graph drawing algorithms draw the complete directed graph either hierarchically or cyclic. Therefore, we int...
متن کاملTopological Complexity in Protein Structures
Abstract: For DNAmolecules, topological complexity occurs exclusively as the result of knotting or linking of the polynucleotide backbone. By contrast, while a few knots and links have been found within the polypeptide backbones of some protein structures, non-planarity can also result from the connectivity between a polypeptide chain and interand intra-chain linking via cofactors and disulfide...
متن کاملTopological Complexity of Motion Planning
In this paper we study a notion of topological complexity TC(X) for the motion planning problem. TC(X) is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, TC(X) is the minimal number k such that there are k different “motion planning rules”, each defined on an open subset of X×X, so that each rule is continuous in the source a...
متن کاملTopological Complexity of Graphic Arrangements
By combining Yuzvinsky’s criteria from [13] with tools from graph theory, we obtain an explicit combinatorial condition on a finite graph G which guarantees that the higher topological complexity TCs of the complement of the associated graphic arrangement AG is equal to the dimensional upper bound sr − 1, where r is the rank of AG.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied and Computational Topology
سال: 2019
ISSN: 2367-1726,2367-1734
DOI: 10.1007/s41468-019-00034-x